A Resolution Procedure for Description Logics with Nominal Schema
نویسندگان
چکیده
We present a polynomial resolution-based decision procedure for the recently introduced description logic ELHOVn(u) , which features nominal schemas as new language construct. Our algorithm is based on ordered resolution and positive superposition, together with a lifting lemma. In contrast to previous work on resolution for description logics, we have to overcome the fact that ELHOVn(u) does not allow for a normalization resulting in clauses of globally limited size.
منابع مشابه
A Resolution Procedure for Description Logics with Nominal Schemas
We present a polynomial resolution-based decision procedure for the recently introduced description logic ELHOVn(u) , which features nominal schemas as new language construct. Our algorithm is based on ordered resolution and positive superposition, together with a lifting lemma. In contrast to previous work on resolution for description logics, we have to overcome the fact that ELHOVn(u) does n...
متن کاملComparison of the effectiveness of the schema mode therapy and Emotional-focused therapy on styles of conflict resolution, in new married couples with conflict
The aim of this research was to study of comparison of Schema Mode therapy and Emotional-focused therapy (HmT) on styles of conflict resolution in new married couples with conflict. In regard to the purpose, this research was applicable and in regard to procedure, it was a quasi-experimental study with a multi-group pre-test-post-test design with control and follow-up group. The statistical pop...
متن کاملComplexities of Nominal Schemas
In this extended abstract, we review our recent work “Nominal Schemas in Description Logics: Complexities Clarified” [6], to be presented at KR 2014. The fruitful integration of reasoning on both schema and instance level poses a continued challenge to knowledge representation and reasoning. While description logics (DLs) excel at the former task, rule-based formalisms are often more adequate f...
متن کاملExtending Absorption to Nominal Schemas
Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema a...
متن کاملConjunctive Query Containment in Description Logics with n-ary Relations
Recent research points out that query containment is a central problem in several database and knowledge base applications, including data warehousing, data integration, query optimization, and (materialized) view maintenance. In this paper we present a decision procedure for containment of conjunctive queries de ned over a database schema speci ed in a very expressive description logic, compri...
متن کامل